Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

نویسندگان

  • John D. Jakeman
  • Timothy Wildey
چکیده

In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the physical discretization error and the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity of the sparse grid. Utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equivalent a posteriori error estimates for spectral element solutions of constrained optimal control problem in one dimension

‎In this paper‎, ‎we study spectral element approximation for a constrained‎ ‎optimal control problem in one dimension‎. ‎The equivalent a posteriori error estimators are derived for‎ ‎the control‎, ‎the state and the adjoint state approximation‎. ‎Such estimators can be used to‎ ‎construct adaptive spectral elements for the control problems.

متن کامل

Blockwise Adaptivity for Time Dependent Problems Based on Coarse Scale Adjoint Solutions∗

We describe and test an adaptive algorithm for evolution problems that employs a sequence of “blocks” consisting of fixed, though nonuniform, space meshes. This approach offers the advantages of adaptive mesh refinement but with reduced overhead costs associated with load balancing, remeshing, matrix reassembly, and the solution of adjoint problems used to estimate discretization error and the ...

متن کامل

A posteriori error estimates for adaptive finite element discretizations of boundary control problems

We are concerned with an a posteriori error analysis of adaptive finite element approximations of boundary control problems for second order elliptic boundary value problems under bilateral bound constraints on the control which acts through a Neumann type boundary condition. In particular, the analysis of the errors in the state, the adjoint state, the control, and the adjoint control invokes ...

متن کامل

A two-dimensional moving finite element method with local refinement based on a posteriori error estimates

In this paper, we consider the numerical solution of time-dependent PDEs using a finite element method based upon rh-adaptivity. An adaptive horizontal method of lines strategy equipped with a posteriori error estimates to control the discretization through variable time steps and spatial grid adaptations is used. Our approach combines an r-refinement method based upon solving so-called moving ...

متن کامل

Robust Estimates for hp-Adaptive Approximations of Non-Self-Adjoint Eigenvalue Problems

We present new residual estimates based on Kato’s square root theorem for spectral approximations of non-self-adjoint differential operators of convection–diffusion–reaction type. These estimates are incorporated as part of an hp-adaptive finite element algorithm for practical spectral computations, where it is shown that the resulting a posteriori error estimates are reliable. Provided experim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comput. Physics

دوره 280  شماره 

صفحات  -

تاریخ انتشار 2015